Strategies for interconnection networks: Some methods from graph theory
نویسندگان
چکیده
منابع مشابه
The graph theory general position problem on some interconnection networks
Given a graph G, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gpnumber for short) of G and denoted by gp(G). In this paper, the gp-number is determined for a large class of subgraphs of the infinite grid graph and for the infinite diagonal gr...
متن کاملSome Topological Methods in Graph Coloring Theory
Attempts to solve the famous Four Color Problem led to fruitful discoveries and rich coloring theories. In this talk, some old and some recent applications of tools from topology to graph coloring problems will be presented. In particular, the following subjects will be treated: The use of Euler’s formula and local planarity conditions, Kempe equivalence, homotopy, winding number and its higher...
متن کاملInterconnection Strategies for Wireless Access Networks
Halim Yanikomeroglu and Elvino S. Sousa Department of Electrical and Computer Engineering, University of Toronto E-mails: fhalim,[email protected] Abstract | The Steiner minimal tree (SMT) architecture is proposed for the wired-network infrastructure of wireless access networks. It is demonstrated that the wireless access networks having star or bus logical topologies can be realized with...
متن کاملCompact Layouts for Some Interconnection Networks
In this work we present some compact layouts of interconnection networks and their components. The main parameter for optimization is a layout area. Besides, other features like the number of the wire bends and component scalability are also studied and improved, in some cases. We focus on the layouts on a rectilinear grid. More precisely, it is a square grid. We use the Thompson layout model, ...
متن کاملBroadcasting on Incomplete Star Graph Interconnection Networks
In this paper, we propose two one-to-all optimal broadcasting algorithms in incomplete star graphs. A n incomplete star graph with N nodes, where (n l ) ! < N < n! , is a subgraph of an n-star. Using a routing scheme to transmit a message to each substar composed of the incomplete star, our proposed broadcasting algorithm is optimal in O(n1ogn) on the single-port communication model. While broa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 1986
ISSN: 0743-7315
DOI: 10.1016/0743-7315(86)90008-0